Priva Possible Individuals 1 Possible Individuals – Semantics Seminar Paper
نویسندگان
چکیده
منابع مشابه
Òòööð ¹¹òóòýññþþøøóò × Ààöö
Adam Meyerson 1 Ryan Williams2 Mar h 2003 CMU-CS-03-113 S hool of Computer S ien e Carnegie Mellon University Pittsburgh, PA 15213 Abstra t The strategy of k-anonymization, proposed by Sweeney [7℄ is a te hnique for prote ting the priva y of individuals while allowing large-s ale data mining. An optimum anonymization is one whi h obtains the required priva y prote tion (insuring that every indi...
متن کاملCounterpart Semantics for Quantified Modal Logic
In this paper we deal with the semantics for quantified modal logic, QML in short, and their philosophical relevance. In the first part we introduce Kripke semantics for the first-order modal language L= with identity, then we consider some unsatisfactory features of this account from an actualist point of view. In addition, we show that the calculus QE .K + BF on free logic, with the Barcan fo...
متن کاملRelationships Between Probabilistic Description and First-Order Logics
This paper analyzes the probabilistic description logic P-SHIQ as a fragment of first-order probabilistic logic (FOPL). P-SHIQ was suggested as a language that is capable of representing and reasoning about different kinds of uncertainty in ontologies, namely generic probabilistic relationships between concepts and probabilistic facts about individuals. However, some semantic properties of P-SH...
متن کاملStrict Identity with No Overlap
It is natural to think that a standard, Kripke-style semantics for quantified modal logic (QML) is incompatible with the view that no individual can exist in more than one possible world, a view that seems to require a Lewis-style, counterpart-theoretic semantics instead. Strictly speaking, however, this thought is wrong-headed. A standard semantics regards a modal statement such as ‘I might ha...
متن کاملCount Distinct Semantic Queries over Multiple Linked Datasets
In this paper, we revise count distinct queries and their semantics over datasets with incomplete knowledge, which is a typical case for the linked data integration scenario where datasets are viewed as ontologies. We focus on counting individuals present in the signature of the ontology. Specifically, we investigate the Certain Epistemic Count (CEC) and the Possible Epistemic Count (PEC) inter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005